Informatics Publishing Limited

M. L. Valarmathi ¹, A. Noble Mary Juliet ²

Affiliations
1 Bharathiyar University, Coimbatore, IN
2 Department of Computer Science and Engineering, N.P.R College of Engineering and Technology, Dindigul, IN

Abstract

Vehicle-to-Vehicle Communication can be used to exchange information like collision warning, up-to-date traffic condition and weather information between drivers on the road. This allows the driver of one vehicle can exchange information to others on the particular area. Network scalability and security mechanism are major challenge in this Vehicle-to-Vehicle communication. This paper presents the concept of Vehicle-Vehicle communication system, analysis the major research challenges in this field and discuss its applications.

Keywords

V2V, VANET and MANet.

Full Text

     

P. Devaki ¹, M. L. Valarmathi ²

Affiliations
1 Department of CSE, Kumara Guru College of Technology, Coimbatore – 641 049, Tamil Nadu, IN
2 Department of CSE, Government College of Technology, Coimbatore – 641013, Tamil Nadu, IN

Abstract

Grid computing, a next leap in communication technology, a new trend in distributed computing systems, enables utilization of idle resources existing worldwide, to solve data intensive and computational intensive problems. These heterogeneous resources are shared from multiple administrative domains. The problem is divided into independent jobs and the jobs are executed by the resources available in grid. Scheduling these tasks to various resources in a grid is a very important problem and it is NP Complete. Hence we need a good job scheduling strategy to utilize the grids effectively such that overall completion time (makespan) is minimized. In literature, many heuristic scheduling approaches are available that give near optimal solution. In this paper we propose a weighted QoS (Quality of Service) factor enabled ant colony algorithm for scheduling independent jobs on heterogeneous grid resources. The main contribution of our work is to minimize the makespan (overall completion time) with QoS satisfaction and the results are compared with max-min and min-min algorithm.

Keywords

Ant Colony, Grid Computing, Job Scheduling, Makespan, QoS.

Full Text

     

C. Ramathilagam ¹, M. L. Valarmathi ²

Affiliations
1 CSE, Anna University, Chennai, IN
2 Dept. of CSE, GCT, CBE, IN

Abstract

Ontologies, the explicit and formal specification of a conceptualization, increase rapidly with the growth of the Semantic Web. However, most of data on the Web are still stored in Relational Databases (RDB). It is important to develop ways for representation of this information or to establish interoperability between RDBs and Ontologies in the Semantic Web to allow intelligent information retrieval. An effective way to achieve interoperability is finding mappings between RDB schemas and Ontologies. This paper surveys various techniques, tools and applications for mapping between RDBs and the Ontology based on certain classifications. The classifications mentioned denotes the purpose of the mapping process or the necessity to relate RDB with Ontology. This paper also reviews the discussed works with two parameters which helps to identify the purpose of the work. Apart from these classifications and given parameters there are several other parameters that can be considered in the mapping approaches.

Keywords

Ontology, Owl, RDF, Schema, Semantics, Mapping, Semantic Web.

Full Text

     

M. Deva Priya ¹, M. L. Valarmathi ², D. Prithviraj ¹

Affiliations
1 Department of Computer Science and Engineering, Sri Krishna College of Technology, IN
2 Department of Computer Science and Engineering, Government College of Technology, IN

Abstract

IEEE 802.16e has received wide attention as it supports high data rates and incredible pervasive connectivity with high Quality of Service (QoS) capabilities. To support QoS, many Bandwidth REQuest (BW-REQ) mechanisms are suggested in the literature for resource reservation in mobile WiMAX networks. There are chances for performance degradation with increase in the number of requests. QoS can be ensured if a contention resolution scheme is designed for sending BW-REQs to the Base Station (BS). To improve the efficiency of the random access mechanisms in the standard, a new mechanism called Dynamic Contention Resolution Scheme (DCRS) is proposed for IEEE 802.16e networks. DCRS groups the requests based on their service types and dynamically calculates the number of Contention slots based on the Arrival Rate (l) of requests.

Keywords

Broadband Wireless Access (BWA), IEEE 802.16e, Bandwidth Requests (BW-REQ), Contention Window, Quality of Service (QoS).

Full Text

     

M. Deva Priya ¹, M. L. Valarmathi ², K. Jaya Bharathi ¹, M. Deepa ¹

Affiliations
1 Department of Computer Science and Engineering, Sri Krishna College of Technology, IN
2 Department of Computer Science and Engineering, Government College of Technology, Coimbatore, IN

Abstract

The next generation wireless communication system aims at supporting multimedia services with different Quality of Services (QoS) and bandwidth requirements. Therefore effective management of limited resources is important to enhance network performance. Access Service Network Gateway (ASN GW) relocation is the process of changing the traffic's Anchor Point (AP) from one GW to another which is independent of Mobile Station's (MS's) Link Layer (LL) handover. The existing standards have details about the ASN relocation procedures, but do not specify when the ASN GW relocation has to be performed. As relocation is closely related to Admission Control, the proposed system combines gateway relocation and Admission Control to determine when to perform ASN GW relocation. This novel Bandwidth based Admission Control (BAC) Scheme considers the size of requests from each MS rather than taking the number of MSs as a whole. This mobility management scheme defined for WiMAX networks minimizes handover delay, packet loss, handover dropping probability, new call blocking probability and maximizes the throughput.

Keywords

Handover, Gateway Relocation, Admission Control (AC), Dropping Probability, Blocking Probability.

Full Text

     

R. Praveena Priyadarsini ¹, M. L. Valarmathi ², S. Sivakumari ¹

Affiliations
1 Department of Computer Science and Engineering, Avinashilingam Deemed University for Women, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Government College of Technology, Tamil Nadu, IN

Abstract

Privacy-preservation is a step in data mining that tries to safeguard sensitive information from unsanctioned disclosure and hence protecting individual data records and their privacy. There are various privacy preservation techniques like k-anonymity, l-diversity and t-closeness and data perturbation. In this paper k-anonymity privacy protection technique is applied to high dimensional datasets like adult and census. since, both the data sets are high dimensional, feature subset selection method like Gain Ratio is applied and the attributes of the datasets are ranked and low ranking attributes are filtered to form new reduced data subsets. K-anonymization privacy preservation technique is then applied on reduced datasets. The accuracy of the privacy preserved reduced datasets and the original datasets are compared for their accuracy on the two functionalities of data mining namely classification and clustering using naïve Bayesian and k-means algorithm respectively. Experimental results show that classification and clustering accuracy are comparatively the same for reduced k-anonym zed datasets and the original data sets.

Keywords

Privacy Preservation, Data Mining, K-Anonymity, Feature Subset Selection, Gain Ratio.

Full Text